Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue
نویسنده
چکیده
This paper studies a multi-server queueing system with multiple types of customers and last-come-®rst-served (LCFS) non-preemptive service discipline. First, a quasi-birth-and-death (QBD) Markov process with a tree structure is de®ned and some classical results of QBD Markov processes are generalized. Second, the MMAP[K]/PH[K]/N/LCFS non-preemptive queue is introduced. Using results of the QBD Markov process with a tree structure, explicit formulas are derived and an ecient algorithm is developed for computing the stationary distribution of queue strings. Numerical examples are presented to show the impact of the correlation and the pattern of the arrival process on the queueing process of each type of customer. Ó 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
Classification of Markov Processes of Matrix M/G/1 type with a Tree Structure and its Applications to the MMAP[K]/G[K]/1 Queue
The purpose of this paper is to study the classification problem of discrete time and continuous time Markov processes of matrix M/G/1 type with a tree structure. We begin this paper by developing a computational method to find whether a Markov process of matrix M/G/1 type with a tree structure is positive recurrent, null recurrent, or transient. The method is then used to study the impact of t...
متن کاملThe Discrete Time MMAP[K]/PH[K]/1/LCFS-GPR Queue and Its Variants
Abstract: In this paper, we study a discrete time queueing system with multiple types of customers and a last-come-first-served general preemptive resume (LCFS-GPR) service discipline (MMAP[K]/PH[K]/1/LCFS-GPR). When the waiting space is infinite, matrix analytic methods are used to find a system stability condition, to derive the distributions of the busy periods and sojourn times, and to obta...
متن کاملClassification of Markov Processes of Matrix M/G/1 type with a Tree Structure and its Applications to the MMAP[K]/G[K]/1 Queues
This paper studies the classification problem of discrete time and continuous time Markov processes of matrix M/G/1 type with a tree structure. It is shown that the Perron-Frobenius eigenvalue of a nonnegative matrix provides information for a complete classification of the Markov process of interest. A computational method is developed to find whether a Markov process of matrix M/G/1 type with...
متن کاملStability Conditions of the MMAP[K]/G[K]/1/LCFS Preemptive Repeat Queue
Stability Conditions of the MMAP[K]/G[K]/1/LCFS Preemptive Repeat Queue Qi-Ming HE, Department of Industrial Engineering, DalTech, Dalhousie University Halifax, Nova Scotia, Canada B3J 2X4, [email protected] Hui Li, Department of Mathematics, Mount Saint Vincent University Halifax, Nova Scotia, Canada B3M 2J6, Email: [email protected]
متن کاملComputational Analysis of MMAP [K]/PH[K]/1 Queues with a Mixed FCFS and LCFS Service Discipline
This paper studies a queueing system with a Markov arrival process with marked arrivals and PH-distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first-come-first-served (FCFS) and last-come-first-served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 120 شماره
صفحات -
تاریخ انتشار 2000